Computability and human symbolic output

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Timothy Melvin COMPUTABILITY AND HUMAN SYMBOLIC OUTPUT

This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in ...

متن کامل

A Path Exploration based on Symbolic Output

Efficient program path exploration is important for many software engineering activities such as testing, debugging and verification. However, enumerating all paths of a program is prohibitively expensive. In this paper, we develop a partitioning of program paths based on the program output. Two program paths are placed in the same partition if they derive the output similarly, that is, the sym...

متن کامل

L1-Computability, Layerwise Computability and Solovay Reducibility

We propose a hierarchy of classes of functions that corresponds to the hierarchy of randomness notions. Each class of functions converges at the corresponding random points. We give various characterizations of the classes, that is, characterizations via integral tests, L-computability and layerwise computability. Furthermore, the relation among these classes is formulated using a version of So...

متن کامل

Ordered Structures and Computability Ordered Structures and Computability Dedication

We consider three questions surrounding computable structures and orderings. First, we make progress toward answering a question of Downey, Hirschfeldt, and Goncharov by showing that for a large class of countable linear orderings, the Turing degree spectrum of the successor relation is closed upward in the c.e. degrees. Next we consider computable partial orders (specifically, finitely branchi...

متن کامل

Symbolic Grey-Box Learning of Input-Output Relations

Learning of stateful models has been extensively used in verification. Some applications include inference of interface invariants, learning-guided concolic execution, compositional verification, and regular model checking. Learning shows a great promise for verification, but suffers from two fundamental limitations. First, learning stateful models over concrete alphabets does not scale in prac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logic and Logical Philosophy

سال: 2014

ISSN: 2300-9802,1425-3305

DOI: 10.12775/llp.2014.009